linear inequality constraint造句
例句與造句
- Aiming at more general nonlinear optimizations subject to linear inequality constraints , this article proposes curvilinear path trust region algorithms
本文針對(duì)更為一般的帶線性不等式約束的優(yōu)化問(wèn)題提出弧線路徑信賴域算法。 - This paper gived an alternating iterative algorithm , and solved parameters estimation question of math model in the case of unknown error variances , which some linear models with the same parameters with linear inequality constraints , at last , data modeling was done
摘要本文對(duì)不等式約束條件下，具有相同參數(shù)的多個(gè)線性模型的參數(shù)，在方差未知的情況下，給出了一種迭代算法，并利用一組隨機(jī)數(shù)據(jù)對(duì)此算法進(jìn)行了模擬。 - Otherwise , the trust region radius is reduced and a new trial point is selected . it is possible that the region subproblem need to be resolved many times before obtaining an acceptable step , and hence the total computation for completing one iteration might be expensive . this article combines approximate trust region path and nonmonotonic backtracking strategy to solve nonlinear optimization subject to linear inequality constraints , that is , we use approximate trust region path to get the research direction by minimuming quadratical model in the trust region by employing
本文在求解線性不等式約束優(yōu)化問(wèn)題時(shí)，將近似信賴域路徑與非單調(diào)信賴域方法相結(jié)合，即在信賴域半徑內(nèi)沿近似信賴域路徑得到一極小化二次模型的搜索方向后采用回代法避免重復(fù)求解信賴域子問(wèn)題，在此算法中當(dāng)搜索方向不被接受時(shí)，就用非單調(diào)線搜索技術(shù)得到接受步長(zhǎng)，定義新的迭代點(diǎn)。 - It's difficult to find linear inequality constraint in a sentence. 用linear inequality constraint造句挺難的